A Block Toeplitz Look - Ahead Schur
نویسندگان
چکیده
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
منابع مشابه
A Block Toeplitz Look-ahead Schur Algorithm
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
متن کاملA look-ahead Schur Algorithm
The classical Schur algorithm computes the LDL T factorization of a symmetric Toeplitz matrix in O(n 2) operations, but requires that all the principal minors of the matrix be nonsingular. Look-ahead schemes have been proposed to deal with matrices that have exactly singular principal minors 9], 11]. Unfortunately, these algorithms cannot be extended to matrices that have ill-conditioned princi...
متن کاملNORTH- HOLLAND High Performance Algorithms for Toeplitz and Block Toeplitz Matrices
In this paper, we present several high performance variants of the classical Schur algorithm to factor various Toeplitz matrices. For positive definite block Toeplitz matrices, we show how hyperbolic Householder transformations may be blocked to yield a block Schur algorithm. This algorithm uses BLAS3 primitives and makes efficient use of a memory hierarchy. We present three algorithms for inde...
متن کامل1 A look - ahead algorithm for the solution of block Toeplitz systems Marc
In this paper, we give a weakly stable algorithm to solve a block Toeplitz system of linear equations. If the \look-ahead" steps taken to compute the parameters of the inversion formula for the block Toeplitz matrix are small compared to the order n of the matrix, the algorithm requires O(n 2) oating point operations. The parameters of the inversion formula are interpreted and computed in a rec...
متن کاملBlock Diagonal and Schur Complement Preconditioners for Block-Toeplitz Systems with Small Size Blocks
Abstract. In this paper we consider the solution of Hermitian positive definite block-Toeplitz systems with small size blocks. We propose and study block diagonal and Schur complement preconditioners for such block-Toeplitz matrices. We show that for some block-Toeplitz matrices, the spectra of the preconditioned matrices are uniformly bounded except for a fixed number of outliers and this fixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995